The Cheeger Constants of Random Belyi Surfaces

نویسندگان

چکیده

Abstract Brooks and Makover developed a combinatorial model of random hyperbolic surfaces by gluing certain ideal triangles. In this paper, we show that for any $\epsilon>0$, as the number triangles goes to infinity, generic surface in Brooks–Makover’s has Cheeger constant less than $\frac {3}{2\pi }+\epsilon $.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cheeger Constants of Surfaces and Isoperimetric Inequalities

We show that the if the isoperimetric profile of a bounded genus non-compact surfaces grows faster than √ t, then it grows at least as fast as a linear function. This generalizes a result of Gromov for simply connected surfaces. We study the isoperimetric problem in dimension 3. We show that if the filling volume function in dimension 2 is Euclidean, while in dimension 3 is sub-Euclidean and th...

متن کامل

Cheeger constants of Platonic graphs

The Platonic graphs πn arise in several contexts, most simply as a quotient of certain Cayley graphs associated to the projective special linear groups. We show that when n = p is prime, πn can be viewed as a complete multigraph in which each vertex is itself a wheel on n + 1 vertices. We prove a similar structure theorem for the case of an arbitrary prime power. These theorems are then used to...

متن کامل

An Introduction to Belyi Surfaces

We outline the basic theory of Belyi surfaces, up to Belyi’s theorem (1979, [1]), which characterizes these spaces as precisely those Riemann surfaces that are defined over Q. We then detail the Brooks-Makover construction of a Belyi surface from an oriented cubic graph from [3]. Consequently, we can apply the model of Bollobás in order to randomly pick a Belyi surface. Finally, we briefly expl...

متن کامل

Spectral graph theory: Cheeger constants and discrepancy∗

In this third talk we will discuss properties related to edge expansion. In particular, we will define the Cheeger constant (which measures how easy it is to cut off a large piece of the graph) and state the Cheeger inequalities. We also will define and discuss discrepancy for undirected and directed graphs. We also state the Perron-Frobenius Theorem which is a useful tool in spectral graph the...

متن کامل

Cheeger constants, growth and spectrum of locally tessellating planar graphs

In this article, we study relations between the local geometry of planar graphs (combinatorial curvature) and global geometric invariants, namely the Cheeger constants and the exponential growth. We also discuss spectral applications.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2022

ISSN: ['1687-0247', '1073-7928']

DOI: https://doi.org/10.1093/imrn/rnac323